By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Search This Issue
Volume 22, Issue 4, pp. 1259-1666

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

A Unified View of Graph Searching

Derek G. Corneil and Richard M. Krueger

pp. 1259-1276

BibTeX  Abstract Full Text:  PDF

A Simple Linear Time LexBFS Cograph Recognition Algorithm

Anna Bretscher, Derek Corneil, Michel Habib, and Christophe Paul

pp. 1277-1296

BibTeX  Abstract Full Text:  PDF

On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach

V. Arvind, Christine T. Cheng, and Nikhil R. Devanur

pp. 1297-1324

BibTeX  Abstract Full Text:  PDF

Large Nearly Regular Induced Subgraphs

Noga Alon, Michael Krivelevich, and Benny Sudakov

pp. 1325-1337

BibTeX  Abstract Full Text:  PDF

Perfect Codes of Length $n$ with Kernels of Dimension $n-\log(n+1)-3$

Olof Heden

pp. 1338-1350

BibTeX  Abstract Full Text:  PDF

Incidence Matrices of Projective Planes and of Some Regular Bipartite Graphs of Girth 6 with Few Vertices

C. Balbuena

pp. 1351-1363

BibTeX  Abstract Full Text:  PDF

Nearly Optimal Visibility Representations of Plane Graphs

Xin He and Huaming Zhang

pp. 1364-1380

BibTeX  Abstract Full Text:  PDF

Hamilton Cycles in Planar Locally Finite Graphs

Henning Bruhn and Xingxing Yu

pp. 1381-1392

BibTeX  Abstract Full Text:  PDF

Prolific Codes with the Identifiable Parent Property

Simon R. Blackburn, Tuvi Etzion, and Siaw-Lynn Ng

pp. 1393-1410

BibTeX  Abstract Full Text:  PDF

The Independent Even Factor Problem

Satoru Iwata and Kenjiro Takazawa

pp. 1411-1427

BibTeX  Abstract Full Text:  PDF

Multidimensional Manhattan Street Networks

F. Comellas, C. Dalfó, and M. A. Fiol

pp. 1428-1447

BibTeX  Abstract Full Text:  PDF

Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices

Tomáš Dvořák and Petr Gregor

pp. 1448-1461

BibTeX  Abstract Full Text:  PDF

Total-Coloring of Plane Graphs with Maximum Degree Nine

Lukasz Kowalik, Jean-Sébastien Sereni, and Riste Škrekovski

pp. 1462-1479

BibTeX  Abstract Full Text:  PDF

Odd Minimum Cut Sets and $b$-Matchings Revisited

Adam N. Letchford, Gerhard Reinelt, and Dirk Oliver Theis

pp. 1480-1487

BibTeX  Abstract Full Text:  PDF

Analysis of Serial Turbo Codes over Abelian Groups for Symmetric Channels

Federica Garin and Fabio Fagnani

pp. 1488-1526

BibTeX  Abstract Full Text:  PDF

Tropical Linear Spaces

David E. Speyer

pp. 1527-1558

BibTeX  Abstract Full Text:  PDF

Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice

Daniel Král' and Petr Škoda

pp. 1559-1569

BibTeX  Abstract Full Text:  PDF

Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends

Xiao Zhou and Takao Nishizeki

pp. 1570-1604

BibTeX  Abstract Full Text:  PDF

How Many Points Can Be Reconstructed from $k$ Projections?

Jiří Matoušek, Aleš Přívětivý, and Petr Škovroň

pp. 1605-1623

BibTeX  Abstract Full Text:  PDF

Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs

Gregory Gutin, Arash Rafiey, and Anders Yeo

pp. 1624-1639

BibTeX  Abstract Full Text:  PDF

On the Polytope of the (1,2)-Survivable Network Design Problem

Mohamed Didi Biha, Hervé Kerivin, and A. Ridha Mahjoub

pp. 1640-1666

BibTeX  Abstract Full Text:  PDF